An Operational Semantics and a Compiler for Modechart Speciications

نویسنده

  • Aloysius K. Mok
چکیده

The Modechart speciication language is a formalism for speciication of real-time systems. The original semantics of the language is described in an axiomatic style, with Real-Time Logic being the underlaying logic. We introduce a new formal semantics for it in an operational style in two steps. The semantics for the class of deterministic speciications is introduced rst and then it is extended for the general class of non-deterministic speciications. The deterministic semantics leads very naturally to an implementation of a compiler, which is described as well. An enhancement to that compiler provides support for a limited, but very useful in practice, subset of the class of non-deterministic speciications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Operational Semantics and Compiler for Real-time Speciications

The Modechart speciication language is a formalism for the speciication and implementation of real-time systems. The semantics of the language was formally deened axiomatically in Real-Time Logic. This paper presents the semantics for Modechart in an operational style and a compiler for automatically synthesizing speciications. Modechart is a synchronous language, which assumes the synchronous ...

متن کامل

Compiling Modechart Speciications

The Modechart speciication language is a formalism for the speciication of real-time systems. A toolset for speciication, analysis and simulation for Modechart speciications exists for supporting the design and construction of real-time systems CHLR93]. This paper introduces a new tool in the the toolset: a compiler for a class of Modechart speciications, namely, that of deterministic system sp...

متن کامل

Asm-based Mechanized Veriication of Compiler Back-ends

We describe an approach to mechanically prove the correct-ness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages spec-iied by means of Abstract State Machines 14]. In 27] we decomposed the correctness condition based on these operational semantics in...

متن کامل

Mechanized Veri cation of Compiler Backends

We describe an approach to mechanically prove the correctness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages speciied by means of Abstract State Machines 15]. In 31] we decomposed the correctness condition based on these operational semantics into...

متن کامل

ASM-based Mechanized Verification of Compiler Back-Ends

We describe an approach to mechanically prove the correct-ness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages spec-iied by means of Abstract State Machines 14]. In 27] we decomposed the correctness condition based on these operational semantics in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996